Constant Bandwidth vs Proportional Share Resource Allocation
نویسندگان
چکیده
Due to the success of new multimedia technologies, there is a great interest for providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in literature are based on proportional share resource allocation, such as WFQ, WF2Q, EEVDF, or SFQ. In a previous paper, we showed how to perform resource reservation according to a Constant Bandwidth allocation. In this paper we compare Proportional Share and Constant Bandwidth resource allocation strategies, by showing advantages and drawbacks of both techniques.
منابع مشابه
Optimal Buffer and Bandwidth Allocation using Effective Bandwidth
We consider a single node which multiplexes a large number of traffic sources. We restrict ourselves to consideration of aggregates of i.i.d. flows that can modelled using effective bandwidth results. We are concerned with the amount of buffer and bandwidth that should be allocated to this aggregate, under a maximum overflow probability constraint. Unlike previous approaches which assume that t...
متن کاملStateless Proportional Bandwidth Allocation
This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during co...
متن کاملOptimal Buffer and Bandwidth Allocation for Multiplexed On/Off Sources
We consider a single node which multiplexes a large number of traffic sources. We are concerned with the amount of buffer and bandwidth that should be allocated to a class of i.i.d. on/off fluid flows. We impose a maximum overflow probability on the class, and assume that the aggregate flow can be modelled using effective bandwidth. Unlike previous approaches which assume that the total buffer ...
متن کاملLottery and stride scheduling: flexible proportional-share resource management
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are introduced, including both randomized and deterministic algorithms that provide proportional-share control over resource consumption rates. Such control is beyond the capabilities of conventional s...
متن کاملA Resource Management Framework for Central Servers
Proportional-share resource management is becoming increasingly important in today’s computing environments. In particular, the growing use of the computational resources of central service providers argues for a proportional-share approach that allows clients to obtain resource shares that reflect their relative importance. In such environments, clients must be isolated from one another to pre...
متن کامل